A Generalization of Ifs with Probabilities to Innnitely Many Maps

نویسنده

  • Franklin Mendivil
چکیده

This paper considers the problem of extending the notion of an IFS with probabilities from the case of nitely many maps in the IFS to the case of innnitely many maps. We prove that under an average contractiv-ity condition the IFS is contractive in the Monge-Kantorovich metric. We also show that the invariant distribution is continuous with respect to the parameters of the IFS. Furthermore, using results of Lewellen , we obtain a result relating the support of the invariant measure to the attractor of the "geometric" IFS. Finally, we discuss the issue of the convergence of integrals with respect to the invariant measure and estimates on the error of these integrals.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chaos Games " for Iterated Function Systems withGrey Level

Two random iteration algorithms or \chaos games" for Iterated Function Systems on function spaces, namely IFS with grey level maps (IFSM), are described. The rst algorithm can be interpreted as a \chaos game in code space" and is guaranteed to work only in the case of nonoverlapping IFS maps. In the second algorithm, applicable to IFSM with overlapping IFS maps but aane grey level maps, the (no...

متن کامل

Infinite Iterated Function

We examine iterated function systems consisting of a countably innnite number of contracting mappings (IIFS). We state results analogous to the well-known case of nitely many mappings (IFS). Moreover, we show that IIFS can be approximated by appropriately chosen IFS both in terms of Hausdorff distance and of Hausdorff dimension. Comparing the descriptive power of IFS and IIFS as mechanisms deen...

متن کامل

A New Probabilistic Approach for Fractal Based Image Compression

Approximation of an image by the attractor evolved through iterations of a set of contractive maps is usually known as fractal image compression. The set of maps is called iterated function system (IFS). Several algorithms, with different motivations, have been suggested towards the solution of this problem. But, so far, the theory of IFS with probabilities, in the context of image compression,...

متن کامل

Existence of Innnitely Many Weakly Harmonic Extensions into S 2 for Non-constant Boundary Maps

We prove the existence of innnitely many weakly harmonic maps from a domain of R n into S 2 for non-constant smooth boundary data.

متن کامل

A generalization of Profile Hidden Markov Model (PHMM) using one-by-one dependency between sequences

The Profile Hidden Markov Model (PHMM) can be poor at capturing dependency between observations because of the statistical assumptions it makes. To overcome this limitation, the dependency between residues in a multiple sequence alignment (MSA) which is the representative of a PHMM can be combined with the PHMM. Based on the fact that sequences appearing in the final MSA are written based on th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998